Using strict implication in background theories for abductive tasks
نویسنده
چکیده
Abduction is usually defined in terms of classical logical consequence. In this paper we substitute this ’inferential parameter’ by the notion of strict implication. By doing so we hope to put more of the intended meaning of the abductive explanative relation into the background theory. By using strict rather than material implication static domain knowledge for abductive tasks can deal with some limitations of the truthfunctional nature of material implication. It can be proved that by using strict instead of material implication the same explanations can be computed according to a strict version of abduction.
منابع مشابه
Integrating Induction and Abduction in Logic Programming
We propose an approach for the integration of abduction and induction in Logic Programming. We de ne an Abductive Learning Problem as an extended Inductive Logic Programming problem where both the background and target theories are abductive theories and where abductive derivability is used as the coverage relation instead of deductive derivability. The two main bene ts of this integration are ...
متن کاملSemantics and Complexity of Abduction from Default Theories
Since logical knowledge representation is commonly based on nonclassical formalisms like default logic, autoepistemic logic, or circumscript ion, it is necessary to perform abductive reasoning f rom theories of nonclassical logics. In this paper, we investigate how abduction can be performed from theories in default logic. Different modes of abduction are plausible, based on credulous and skept...
متن کاملEquality and Abductive Residua for Horn Clauses
One method of proving theorems in Horn clause theories is surface deduction (also known as the modiication method). Surface deduction yields interpretations of uniication failures in terms of residual hypotheses needed for uniication to succeed. This suggests that it can be used for abductive reasoning with equality. In surface deduction the input clauses are rst transformed to a at form (invol...
متن کاملA Graph Theoretic Optimisation of Temporal Abductive Validation
Abductive validation for a theory T expressed in language LQCM is known to be exponential. Despite this, abductive validation over LQCM using the HT4 abductive inference engine is a useful technique for a large range of real-world theories. However, doubts persist about LTQCM: a time-based variant of LQCM. In LTQCM, abductive validation is executed for for theories used in long time-based simul...
متن کاملConferences Abduction and Induction in AI : Report of the IJCAI ’ 97 Workshop
• What (if anything) distinguishes/characterizes each form of reasoning and their corresponding computational models? • How can we characterize different prototypical AI tasks for which it is appropriate to use one of these two forms of reasoning? • How can Abduction and Induction be integrated in the context of Artificial Intelligence problems? For example, – How do we learn abductive theories...
متن کامل